A scalable schur-complement fluids solver for heterogeneous compute platforms

A model of dynamic compilation for heterogeneous compute platforms

A preconditioner for the Schur complement matrix

A preconditioner for iterative solution of the interface problem in Schur Complement Domain Decomposition Methods is presented. This preconditioner is based on solving a problem in a narrow strip around the interface. It requires much less memory and computing time than classical Neumann-Neumann preconditioner and its variants, and handles correctly the flux splitting among subdomains that shar...

HIPS : a parallel hybrid direct/iterative solver based on a Schur complement approach

The resolution of large sparse linear systems is often the most consuming step in scientific applications. Direct methods are very robust but they need a prohibitive amount of memory and CPU time to deal with very large systems arising from 3D problems. On the other hand, generic preconditioners for iterative methods are often based on incomplete factorizations. The robustness of these precondi...

On Preconditioning Schur Complement and Schur Complement Preconditioning

We study two implementation strategies to utilize Schur complement technique in multilevel recursive incomplete LU preconditioning techniques (RILUM) for solving general sparse matrices. The first strategy constructs a RILUM to precondition the original matrix. The second strategy solves the first Schur complement matrix using the lower level parts of the RILUM as the preconditioner. We discuss...

A Schur Complement Method for Eigenvalue Problems

Domain decomposition algorithms have received much attention in the last decade [2]. The domain in which a differential equation is defined is partitioned in several subdomains, and the equation is solved in these domains. The local results are integrated to form the solution in the entire domain. Since the subdomains can be solved in parallel, domain decomposition has become very popular on pa...